Permutation Generators of Alternating Groups
نویسندگان
چکیده
using elementary permutations also called modules These modules have a simple structure and are based on internal smaller permutations Two cases are considered In the rst the modules apply internal permutations only It has been proved that the composition of modules generates the alternating group for the number of binary inputs bigger than In the second DES like modules are considered and it is shown that for a large enough number of binary inputs they produce the alternating group as well
منابع مشابه
The Probability of Generating the Symmetric Group When One of the Generators Is Random
A classical result of John Dixon (1969) asserts that a pair of random permutations of a set of n elements almost surely generates either the symmetric or the alternating group of degree n. We answer the question, “For what permutation groups G ≤ Sn do G and a random permutation σ ∈ Sn almost surely generate the symmetric or the alternating group?” Extending Dixon’s result, we prove that this is...
متن کامل. R A ] 1 6 A pr 2 00 9 Algebras and groups defined by permutation relations of alternating type ∗
The class of finitely presented algebras over a field K with a set of generators a1, . . . , an and defined by homogeneous relations of the form a1a2 · · · an = aσ(1)aσ(2) · · · aσ(n), where σ runs through Altn, the alternating group, is considered. The associated group, defined by the same (group) presentation, is described. A description of the radical of the algebra is found. It turns out th...
متن کاملStrong bias of group generators: an obstacle to the "product replacement algorithm"
Let G be a finite group. Efficient generation of nearly uniformly distributed random elements in G, starting from a given set of generators of G, is a central problem in computational group theory. In this paper we demonstrate a weakness in the popular “product replacement algorithm,” widely used for this purpose. The main results are the following. Let Nk(G) be the set of generating k-tuples o...
متن کاملPermutation Groups in
We show that the basic problems of permutation group manipulation admit eecient parallel solutions. Given a permutation group G by a list of generators, we nd a set of NC-eecient strong generators in NC. Using this, we show, that the following problems are in NC: membership in G; determining the order of G; nding the center of G; nding a composition series of G along with permutation representa...
متن کاملBases for Primitive Permutation Groups and a Conjecture of Babai
A base of a permutation group G is a sequence B of points from the permutation domain such that only the identity of G fixes B pointwise. We show that primitive permutation groups with no alternating composition factors of degree greater than d and no classical composition factors of rank greater than d have a base of size bounded above by a function of d. This confirms a conjecture of Babai. Q...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1990